Convex lattice polygons with all lattice points visible
نویسندگان
چکیده
Two lattice points are visible to one another if there exist no other on the line segment connecting them. In this paper we study convex polygons that contain a point such all in polygon from it. We completely classify polygons, show finitely many of width greater than 2, and computationally enumerate As an application classification, prove new obstructions graphs arising as skeleta tropical plane curves.
منابع مشابه
On convex lattice polygons
Let II be a convex lattice polygon with b boundary points and c (5 1) interior points. We show that for any given a , the number b satisfies b 5 2e + 7 , and identify the polygons for which equality holds. A lattice polygon II is a simple polygon whose vertices are points of the integral lattice. We let A = 4(11) denote the area of II , b{U) the number of lattice points on the boundary of II , ...
متن کاملConvex Lattice Polygons
Let n ≥ 3 be an integer. A convex lattice n-gon is a polygon whose n vertices are points on the integer lattice Z 2 and whose interior angles are strictly less than π. Let a n denote the least possible area enclosed by a convex lattice n-gon, then [1, 2, 3] {a n } ∞ n=3 = n 1 2
متن کاملMinkowski decomposition of convex lattice polygons
A relatively recent area of study in geometric modelling concerns toric Bézier patches. In this line of work, several questions reduce to testing whether a given convex lattice polygon can be decomposed into a Minkowski sum of two such polygons and, if so, to finding one or all such decompositions. Other motivations for this problem include sparse resultant computation, especially for the impli...
متن کاملOn the Number of Convex Lattice Polygons
We prove that there are at most exp{cA 1 ^} different lattice polygons of area A. This improves a result of V. I. Arnol'd.
متن کاملConvex lattice polygons of fixed area with perimeter-dependent weights.
We study fully convex polygons with a given area, and variable perimeter length on square and hexagonal lattices. We attach a weight tm to a convex polygon of perimeter m and show that the sum of weights of all polygons with a fixed area s varies as s(-theta(conv))eK(t)square root(s) for large s and t less than a critical threshold tc, where K(t) is a t-dependent constant, and theta(conv) is a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2020.112161